A framework for game tree algorithms
نویسندگان
چکیده
A unifying framework for game tree algorithms is GSEARCH, designed by Ibaraki Ibaraki 86]. In general, a relatively great deal of memory is necessary for instances of this framework. In Ibaraki 91A] an extended framework, called RSEARCH, is discussed, in which the use of memory can be controlled. In this paper variants of above frameworks are introduced, to be called Gsearch and Rsearch respectively. It is shown that, in these frameworks, the classical alpha-beta algorithm is the depth-rst search instance and H* is a best rst search instance. Furthermore two new algorithms, Maxsearch and Minsearch, are presented, both as best-rst search instances. Maxsearch is close to SSS* Stockman] and SSS-2 Pijls-2], whereas Minsearch is close to dual SSS*.
منابع مشابه
Fuegito: an Educational Software Package for Game Tree Search
Fuegito is an educational software package for learning about programming two player games. The package provides a simple, yet flexible and extensible framework which allows students to study the core search algorithms of computer game-playing, and extend them easily in projects. The current version of Fuegito supports alphabeta and Monte Carlo Tree Search as main game tree search methods, as w...
متن کاملA General Multi-Agent Modal Logic K Framework for Game Tree Search
We present an application of Multi-Agent Modal Logic K (MMLK) to model dynamic strategy game properties. We also provide several search algorithms to decide the model checking problem in MMLK. In this framework, we distinguish between the solution concept of interest which is represented by a class of formulas in MMLK and the search algorithm proper. The solution concept defines the shape of th...
متن کاملA modified position value for communication situations and its fuzzification
Myerson treated various situations of cooperation in the field of cooperative games and proposed the communication structure. In this paper, we define and characterize an allocation rule in terms of the position value, called an average spanning tree solution, for communication situations by introducing a concept of cooperation relationship which says that two players are deemed to possess this...
متن کاملGenerating and Solving Imperfect Information Games
Work on game playing in AI has typically ignored games of imperfect information such as poker. In this paper, we present a framework for dealing with such games. We point out several important issues that arise only in the context of imperfect information games, particularly the insufficiency of a simple game tree model to represent the players’ information state and the need for randomization ...
متن کاملComparison of Machine Learning Algorithms for Broad Leaf Species Classification Using UAV-RGB Images
Abstract: Knowing the tree species combination of forests provides valuable information for studying the forest’s economic value, fire risk assessment, biodiversity monitoring, and wildlife habitat improvement. Fieldwork is often time-consuming and labor-required, free satellite data are available in coarse resolution and the use of manned aircraft is relatively costly. Recently, unmanned aeria...
متن کامل